Euclidean Distance Between Haar Orthogonal and Gaussian Matrices
نویسندگان
چکیده
منابع مشابه
Euclidean Distance between Haar Orthogonal and Gaussian Matrices
In this work we study a version of the general question of how well a Haar distributed orthogonal matrix can be approximated by a random gaussian matrix. Here, we consider a gaussian random matrix Yn of order n and apply to it the Gram-Schmidt orthonormalization procedure by columns to obtain a Haar distributed orthogonal matrix Un. If F m i denotes the vector formed by the first m-coordinates ...
متن کاملOn Euclidean distance matrices
If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP . As an application, we obtain a formula for the MoorePenrose inverse of a Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which w...
متن کاملEuclidean Distance Matrices and Applications
Over the past decade, Euclidean distance matrices, or EDMs, have been receiving increased attention for two main reasons. The first reason is that the many applications of EDMs, such as molecular conformation in bioinformatics, dimensionality reduction in machine learning and statistics, and especially the problem of wireless sensor network localization, have all become very active areas of res...
متن کاملEuclidean and circum-Euclidean distance matrices: Characterizations and linear preservers
Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.
متن کاملProperties of Euclidean and Non-Euclidean Distance Matrices
A distance matrix D of order n is symmetric with elements idfj, where d,, = 0. D is Euclidean when the in(n 1) quantities dij can be generated as the distances between a set of n points, X (n X p), in a Euclidean space of dimension p. The dimensionality of D is defined as the least value of p = rank(X) of any generating X; in general p + 1 and p +2 are also acceptable but may include imaginary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2016
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-016-0712-6